Centralized resource allocation with stochastic data
نویسندگان
چکیده
منابع مشابه
negative data on the centralized resource allocation model
data envelopment analysis (dea) is a technique based on mathematical programming for evaluating the efficiency of homogeneous decision making units (dmus). in this technique, inefficient dmus are projected onto the frontier, which was constructed by the best performers. centralized resource allocation (cra) is a method in which all dmus are projected onto the efficient frontier through solving ...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملResource Allocation Under Stochastic Demands
Military theater settings may involve many competing missions whose whose requirements tax the coalition’s resources in multiple dimensions—i.e., requiring different amounts of many different kinds of resources, e.g., fuel, bandwidth, personnel, etc., each of which is available in limited supply— and in uncertain or stochastic amounts. To serve the overall mission, we need to satisfy resource r...
متن کاملResource Allocation through Context-dependent data envelopment analysis
System designs, optimizing resource allocation to organization units, is still being considered as a complicated problem especially when there are multiple inputs and outputs related to a unit. The algorithm presented here will divide the frontiers obtained with DEA. In this way, we investigate a new approach for resource allocation.
متن کاملAsymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.10.009